The Number of Lattice Rules of Speciied Upper Class and Rank

نویسندگان

  • J N Lyness
  • S Joe
چکیده

The upper class of a lattice rule is a convenient e n tity for classiication and other purposes. The rank of a lattice rule is a basic characteristic, also used for classiication. By introducing a rank proportionality factor and obtaining certain recurrence relations, we s h o w h o w m a n y lattice rules of each rank exist in any prime upper class. The Sylow p-decomposition may be used to obtain corresponding results for any upper class.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computing Multivariate Normal Probabilities Using Rank-1 Lattice Sequences ?

Multivariate normal probabilities, which are used for statistical inference, must be computed numerically. This article describes a new rank-1 lattice quadrature rule and its application to computing multivariate normal probabilities. In contrast to existing lattice rules the number of integrand evaluations need not be speciied in advance. When compared to existing algorithms for computing mult...

متن کامل

Frankl's Conjecture for a subclass of semimodular lattices

 In this paper, we prove Frankl's Conjecture for an upper semimodular lattice $L$ such that $|J(L)setminus A(L)| leq 3$, where $J(L)$ and $A(L)$ are the set of join-irreducible elements and the set of atoms respectively. It is known that the class of planar lattices is contained in the class of dismantlable lattices and the class of dismantlable lattices is contained in the class of lattices ha...

متن کامل

An explicit formula for the number of fuzzy subgroups of a finite abelian $p$-group\ of rank two

Ngcibi, Murali and Makamba [Fuzzy subgroups of rank two abelian$p$-group, Iranian J. of Fuzzy Systems {bf 7} (2010), 149-153]considered the number of fuzzy subgroups of a finite abelian$p$-group $mathbb{Z}_{p^m}times mathbb{Z}_{p^n}$ of rank two, andgave explicit formulas for the cases when $m$ is any positiveinteger and $n=1,2,3$. Even though their method can be used for thecases when $n=4,5,l...

متن کامل

Notes on a Search for Optimal Lattice Rules

In this paper some of the results of a recent computer search CoLy99] for optimal three-and four-dimensional lattice rules of speciied trigonometric degree are discussed. The theory is presented in a general frame emphasising the special nature of lattice rules among the rules of speciied trigonometric degree. 1 Background Material In this paper we discuss some of the results of a recent comput...

متن کامل

Determination of the Rank of an Integration Lattice

The continuing and widespread use of lattice rules for high-dimensional numerical quadrature is driving the development of a rich and detailed theory. Part of this theory is devoted to computer searches for rules, appropriate to particular situations. In some applications, one is interested in obtaining the (lattice) rank of a lattice rule Q(Λ) directly from the elements of a generator matrix B...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002